One can use formal approaches either post facto to try to show that a program has desirable properties (main of which is that it satisfies a specification); or one can go for correctness by construction. I not only prefer the latter but I have also argued that this is the main way to get formal methods to pay off: there is more mileage in getting a clean architecture than in trying to debug a bad design by retrofitting a proof; I thing this is also a way to choose an appropriate level of formality perhaps using outline arguments and filling in details if doubt arises (see [Jon96]; Jackson and Wing made a similar point in the same journal; also my position paper at the Royal Society meeting in October 2004 – yet to be printed). But how do we...
Formal methods are not used widely in industrial software development, because the overhead of forma...
Formal methods promises designers increased assurance in and understanding of their designs. Assuran...
A correctness proof is a formal mathematical argument that an algorithm meets its specification, whi...
We reconsider the concept of specification in order to bring new insights into the debate of formal ...
We reconsider the concept of specification in order to bring new insights into the debate of formal ...
Cataloged from PDF version of article.We reconsider the concept of specification in order to bring n...
AbstractThis paper argues the following positions: that a formal specification is a boolean expressi...
AbstractThese notes are personal reflections, stemming from attempts to understand the sources of pr...
International audienceImproving the quality of a system begins by their requirements elicitation: th...
In the long run, programs should be written from the start with verification in mind. Programs writt...
Program verification assumes a formal program specification. In software-intensive systems, such spe...
C) "-- United States Government is authorized to repro uce and *-, distribute reprints for Gove...
Existing verification technology, though theoretically adequate, is not directly applicable to the ...
I attended my first software conference in 1968; it was organised by NATO with the title “The Softwa...
The quality of software produced by students is often poor. How to teach students to develop good qu...
Formal methods are not used widely in industrial software development, because the overhead of forma...
Formal methods promises designers increased assurance in and understanding of their designs. Assuran...
A correctness proof is a formal mathematical argument that an algorithm meets its specification, whi...
We reconsider the concept of specification in order to bring new insights into the debate of formal ...
We reconsider the concept of specification in order to bring new insights into the debate of formal ...
Cataloged from PDF version of article.We reconsider the concept of specification in order to bring n...
AbstractThis paper argues the following positions: that a formal specification is a boolean expressi...
AbstractThese notes are personal reflections, stemming from attempts to understand the sources of pr...
International audienceImproving the quality of a system begins by their requirements elicitation: th...
In the long run, programs should be written from the start with verification in mind. Programs writt...
Program verification assumes a formal program specification. In software-intensive systems, such spe...
C) "-- United States Government is authorized to repro uce and *-, distribute reprints for Gove...
Existing verification technology, though theoretically adequate, is not directly applicable to the ...
I attended my first software conference in 1968; it was organised by NATO with the title “The Softwa...
The quality of software produced by students is often poor. How to teach students to develop good qu...
Formal methods are not used widely in industrial software development, because the overhead of forma...
Formal methods promises designers increased assurance in and understanding of their designs. Assuran...
A correctness proof is a formal mathematical argument that an algorithm meets its specification, whi...